Verified sharp bounds for the real gamma function over the entire floating-point range

نویسنده

  • Siegfried M. Rump
چکیده

An algorithm is presented for computing verified and accurate bounds for the value of the gamma function over the entire real double precision floating-point range. It means that for every double precision floating-point number x except the poles −k for 0 ≤ k ∈ N the true value of Γ(x) is included within an almost maximally accurate interval with floating-point bounds. The application to interval arguments x ∈ IF, thus enclosing the range of Γ over x, is discussed as well.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling the measurement of VVER-1000 reactor power by neutron and gamma radiation with MCNP code

The present study deals with a new method for measuring the power of a reactor. This method uses gamma and neutron radiation resulted from the entire reactor structure, without changing its structure (online). In terms of functionality, this method can measure the reactor power in real-time and report it instantly. In order to obtain the relationship between reactor power and gamma and neutron ...

متن کامل

Lower bounds on the signed (total) $k$-domination number

Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...

متن کامل

Numerical Approximation of Real Functions and One Minkowski’s Conjecture on Diophintine Approximations

In this communication I consider the applications of several kinds of approximations of real functions to the problem of verified computation (reliable computing) of the range of implicitly defined real function xn+1 = G(x1, · · · , xn), where dependency F (x1, · · · , xn+1) = 0 is defined on some compact domain by a sufficiently smooth real function F (x1, · · · , xn+1). Constructive version o...

متن کامل

Estimating the Time of a Step Change in Gamma Regression Profiles Using MLE Approach

Sometimes the quality of a process or product is described by a functional relationship between a response variable and one or more explanatory variables referred to as profile. In most researches in this area the response variable is assumed to be normally distributed; however, occasionally in certain applications, the normality assumption is violated. In these cases the Generalized Linear Mod...

متن کامل

Bounds on the restrained Roman domination number of a graph

A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014